Maximin Choice of Voting Rules for Committees1
نویسندگان
چکیده
In the context of a probabilistic voting model, we investigate the consequences of choosing among voting rules according to the maximin criterion. We characterize the rules that satisfy the maximin criterion as a function of the distribution of voters’ probabilities to favor change. We prove that there are at most two maximin rules, at least one is Pareto efficient and often different to simple majority rule. If a committee is formed only by “conservative voters”, i.e. voters who are more likely to prefer the status quo than change, then the maximin criterion recommends voting rules that are not higher than the simple majority rule. If there are only “radical voters”, then this criterion recommends rules that are not lower than the 50% majority.
منابع مشابه
Optimal manipulation of voting rules
Complexity of voting manipulation is a prominent research topic in computational social choice. The voting manipulation literature usually assumes that the manipulator is only concerned with improving the outcome of the election from her perspective. However, in practice, the manipulator may also be reluctant to lie, i.e., she may have a preference for submitting a vote that does not deviate to...
متن کاملStrategic Voting with Incomplete Information
Classical results in social choice theory on the susceptibility of voting rules to strategic manipulation make the assumption that the manipulator has complete information regarding the preferences of the other voters. In reality, however, voters only have incomplete information, which limits their ability to manipulate. We explore how these limitations affect both the manipulability of voting ...
متن کاملVoting and Bribing in Single-Exponential Time
We introduce a general problem about bribery in voting systems. In the R-Multi-Bribery problem, the goal is to bribe a set of voters at minimum cost such that a desired candidate wins the manipulated election under the voting rule R. Voters assign prices for withdrawing their vote, for swapping the positions of two consecutive candidates in their preference order, and for perturbing their appro...
متن کاملOn the Complexity of Voting Manipulation under Randomized Tie-Breaking
Computational complexity of voting manipulation is one of the most actively studied topics in the area of computational social choice, starting with the groundbreaking work of [Bartholdi et al., 1989]. Most of the existing work in this area, including that of [Bartholdi et al., 1989], implicitly assumes that whenever several candidates receive the top score with respect to the given voting rule...
متن کاملKernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting
In the Possible Winner problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made winner by extending the partial preferences to linear preferences. Previous work has provided, for many common voting rules, fixed parameter tractable algorithms for the Possible Winner problem, with number of candida...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003